Obtaining shorter regular expressions from finite-state automata
نویسندگان
چکیده
منابع مشابه
Obtaining shorter regular expressions from finite-state automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based o...
متن کاملShorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regular expressions from finitestate automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finite-state automata to obtain shorter expressions first. Then, we introd...
متن کاملProvably Shorter Regular Expressions from Finite Automata
A famous theorem due to Kleene [25] states that the regular languages admit two equivalent characterizations of entirely different nature, namely as the languages accepted by finite automata on the one hand, and as those described by regular expressions on the other hand. There are a few classical algorithms for converting finite automata into regular expressions. Those algorithms look differen...
متن کاملProvably Shorter Regular Expressions from Deterministic Finite Automata
We study the problem of finding good elimination orderings for the state elimination algorithm, which is one of the most popular algorithms for the conversion of finite automata into equivalent regular expressions. Based on graph separator techniques we are able to describe elimination strategies that remove states in large induced subgraphs that are “simple” like, e.g., independent sets or sub...
متن کاملRegular Expressions From Deterministic Finite Automata, Revisited
We continue our research on the conversion of deterministic finite automata to equivalent regular expressions from [H. Gruber, M. Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. In: 12th DLT, Number 5257 of LNCS, 2008], where it was shown that every language over a binary alphabet accepted by an n-state deterministic finite automaton can be converted into an equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.09.025